Crowdsourcing the Robin Hood effect in cities
نویسندگان
چکیده
منابع مشابه
Crowdsourcing the Robin Hood effect in cities
Socioeconomic inequalities in cities are embedded in space and result in neighborhood effects, whose harmful consequences have proved very hard to counterbalance efficiently by planning policies alone. Considering redistribution of money flows as a first step toward improved spatial equity, we study a bottom-up approach that would rely on a slight evolution of shopping mobility practices. Build...
متن کاملSupplementary Information for Crowdsourcing the Robin Hood effect in cities
The dataset contains information about 14 million bank card transactions made by customers of the Banco Bilbao Vizcaya Argentaria (BBVA) in the metropolitan areas of Barcelona and Madrid in 2011. For both case studies, we only consider the credit card payments whose amount was inferior to 1000 euros, and which were made inside the metropolitan areas, by bank customers that lived and worked in t...
متن کاملAminophylline for angina: the "Robin Hood" effect?
In normally perfused myocardium, coronary blood flow is greater within the endocardium than in the epicardium because of greater metabolic activity and oxygen requirements. Adequate perfusion is maintained by local autoregulation with greater vasodilation of endocardial arterioles compared with the more constricted epicardial arteriolar bed (l), with alpha-adrenergic tone probably contributing ...
متن کاملThe Robin Hood Syndrome:
Street gangs pose serious threats to their members, to their victims, and to communities at large. The behavior problems associated with gangs are many and varied. Suggested causes for the emergence of gangs are complicated, and many of them are interdependent. Interventions planned to rehabilitate individuals and to weaken the power of the gang are numerous. Research shows that few of these in...
متن کاملOn Worst-Case Robin Hood Hashing
We consider open addressing hashing and implement it by using the Robin Hood strategy; that is, in case of collision, the element that has traveled the farthest can stay in the slot. We hash ∼ αn elements into a table of size n where each probe is independent and uniformly distributed over the table, and α < 1 is a constant. Let Mn be the maximum search time for any of the elements in the table...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Network Science
سال: 2017
ISSN: 2364-8228
DOI: 10.1007/s41109-017-0026-3